The complexity of UNO
نویسندگان
چکیده
This paper investigates the popular card game UNOR © from the viewpoint of algorithmic combinatorial game theory. We define simple and concise mathematical models for the game, including both cooperative and uncooperative versions, and analyze their computational complexity. In particular, we prove that even a single-player version of UNO is NP-complete, although some restricted cases are in P. Surprisingly, we show that the uncooperative two-player version is also in P.
منابع مشابه
UNO Is Hard, Even for a Single Player
This paper investigates the popular card game UNO R © from the viewpoint of algorithmic combinatorial game theory. We define simple and concise mathematical models for the game, including both cooperative and uncooperative versions, and analyze their computational complexity. In particular, we prove that even a single-player version of UNO is NP-complete, although some restricted cases are in P...
متن کاملUNO Gets Easier for a Single Player
This work is a follow up to [2, FUN 2010], which initiated a detailed analysis of the popular game of UNO R ©. We consider the solitaire version of the game, which was shown to be NP-complete. In [2], the authors also demonstrate a n ) algorithm, where c is the number of colors across all the cards, which implies, in particular that the problem is polynomial time when the number of colors is a ...
متن کاملGeneralized Uno and Yagiura’s Algorithm for Alignment Decomposition
We generalize Uno and Yagiura’s algorithm for finding all common intervals of two permutations to the setting of two sequences with many-to-many alignment links across the two sides. Common intervals in such a setting can be interpreted as translationally equivalent phrases between two sentences. We show how to decompose an alignment into hierarchical phrase pairs in linear time.
متن کاملRevisiting T. Uno and M. Yagiura's Algorithm
In 2000, T. Uno and M. Yagiura published an algorithm that computes all the K common intervals of two given permutations of length n in O(n + K) time. Our paper first presents a decomposition approach to obtain a compact encoding for common intervals of d permutations. Then, we revisit T. Uno and M. Yagiura’s algorithm to yield a linear time algorithm for finding this encoding. Besides, we adap...
متن کاملHardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
Spanning tree congestion is a relatively new graph parameter, which has been studied intensively. This paper studies the complexity of the problem to determine the spanning tree congestion for non-sparse graph classes, while it was investigated for some sparse graph classes before. We prove that the problem is NP-hard even for chain graphs and split graphs. To cope with the hardness of the prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1003.2851 شماره
صفحات -
تاریخ انتشار 2010